<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="https://www.bibsonomy.org/tag/learning%20theory"><title>BibSonomy bookmarks for /tag/learning%20theory</title><link>https://www.bibsonomy.org/tag/learning%20theory</link><description>BibSonomy RSS Feed for /tag/learning%20theory</description><items><rdf:Seq><rdf:li rdf:resource="http://maxim.ece.illinois.edu/teaching/SLT/"/><rdf:li rdf:resource="http://www.stat.cmu.edu/~ryantibs/statml/"/><rdf:li rdf:resource="http://www.stats.ox.ac.uk/~rebeschi/teaching/AFoL/18/"/><rdf:li rdf:resource="https://cseweb.ucsd.edu/classes/fa12/cse291-b/"/><rdf:li rdf:resource="http://www.raetschlab.org/lectures/amsa/11-SLT.pdf"/><rdf:li rdf:resource="http://mr.crossref.org/iPage?doi=10.1561%2F2200000037"/><rdf:li rdf:resource="http://www.stevehanneke.com/"/><rdf:li rdf:resource="http://mi.eng.cam.ac.uk/~cz277/doc/Slides-PAC.pdf"/><rdf:li rdf:resource="http://www.mit.edu/~9.520/fall18/#psets"/><rdf:li rdf:resource="https://cs.nyu.edu/~mohri/mlbook/"/><rdf:li rdf:resource="https://people.eecs.berkeley.edu/~wainwrig/stat241b/"/><rdf:li rdf:resource="http://stat.wharton.upenn.edu/~skakade/courses/stat928/"/><rdf:li rdf:resource="https://www.stat.berkeley.edu/~bartlett/courses/2014spring-cs281bstat241b/"/><rdf:li rdf:resource="https://web.stanford.edu/class/cs229t/"/><rdf:li rdf:resource="http://videolectures.net/mlss03_bousquet_slt/"/><rdf:li rdf:resource="https://howsheilaseesit.blog/2017/03/13/time-for-analytics-of-the-oppressed-my-starter-for-10-for-digifest-debate/"/><rdf:li rdf:resource="https://journal.thriveglobal.com/how-technology-hijacks-peoples-minds-from-a-magician-and-google-s-design-ethicist-56d62ef5edf3"/><rdf:li rdf:resource="http://www.businessballs.com/generations-nicknames-theories.htm"/><rdf:li rdf:resource="http://www.hdc.ed.ac.uk/"/><rdf:li rdf:resource="https://www.theguardian.com/education/2017/mar/12/no-evidence-to-back-idea-of-learning-styles"/></rdf:Seq></items></channel><item rdf:about="http://maxim.ece.illinois.edu/teaching/SLT/"><title>Statistical Learning Theory</title><description>Bruce Hajek and Maxim Raginsky: Statistical Learning Theory</description><link>http://maxim.ece.illinois.edu/teaching/SLT/</link><dc:creator>kirk86</dc:creator><dc:date>2020-04-14T02:20:31+02:00</dc:date><dc:subject>course learning notes stats theory website </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Bruce Hajek and Maxim Raginsky: Statistical Learning Theory&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/notes"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/stats"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/website"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.stat.cmu.edu/~ryantibs/statml/"><title>Statistical Machine Learning</title><description>Statistical Machine Learning @ CMU by Ryan Tibshirani</description><link>http://www.stat.cmu.edu/~ryantibs/statml/</link><dc:creator>kirk86</dc:creator><dc:date>2019-11-14T20:08:39+01:00</dc:date><dc:subject>course learning lecture notes stats theory </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Statistical Machine Learning @ CMU by Ryan Tibshirani&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/lecture"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/notes"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/stats"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.stats.ox.ac.uk/~rebeschi/teaching/AFoL/18/"><title>Algorithmic Foundations of Learning 2018 - Oxford University</title><description>Algorithmic Foundations of Learning 2018 - Oxford University</description><link>http://www.stats.ox.ac.uk/~rebeschi/teaching/AFoL/18/</link><dc:creator>kirk86</dc:creator><dc:date>2019-11-14T17:56:15+01:00</dc:date><dc:subject>course learning lecture notes theory website </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Algorithmic Foundations of Learning 2018 - Oxford University&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/lecture"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/notes"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/website"/></rdf:Bag></taxo:topics></item><item rdf:about="https://cseweb.ucsd.edu/classes/fa12/cse291-b/"><title>CSE 291 Fall 2012: Learning Theory</title><description>Fall 2012: Learning Theory Course Material</description><link>https://cseweb.ucsd.edu/classes/fa12/cse291-b/</link><dc:creator>kirk86</dc:creator><dc:date>2019-11-14T13:44:23+01:00</dc:date><dc:subject>course learning lecture notes stats theory website </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Fall 2012: Learning Theory Course Material&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/lecture"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/notes"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/stats"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/website"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.raetschlab.org/lectures/amsa/11-SLT.pdf"><title>Introduction to Statistical Learning Theory</title><description>Introduction to Statistical Learning Theory</description><link>http://www.raetschlab.org/lectures/amsa/11-SLT.pdf</link><dc:creator>kirk86</dc:creator><dc:date>2019-08-03T21:06:54+02:00</dc:date><dc:subject>foundations learning mathematics probability stats theory </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Introduction to Statistical Learning Theory&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/foundations"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/mathematics"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/probability"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/stats"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://mr.crossref.org/iPage?doi=10.1561%2F2200000037"><title>Current Links for 10.1561/2200000037</title><description></description><link>http://mr.crossref.org/iPage?doi=10.1561%2F2200000037</link><dc:creator>kirk86</dc:creator><dc:date>2019-06-17T01:23:59+02:00</dc:date><dc:subject>book learning theory </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2019-06-17T01:23:59+02:00&#034; href=&#034;http://mr.crossref.org/iPage?doi=10.1561%2F2200000037&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://mr.crossref.org/iPage?doi=10.1561%2F2200000037&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/book"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.stevehanneke.com/"><title>Steve Hanneke</title><description></description><link>http://www.stevehanneke.com/</link><dc:creator>kirk86</dc:creator><dc:date>2019-06-17T01:19:04+02:00</dc:date><dc:subject>learning machine-learning theory website </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2019-06-17T01:19:04+02:00&#034; href=&#034;http://www.stevehanneke.com/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.stevehanneke.com/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machine-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/website"/></rdf:Bag></taxo:topics></item><item rdf:about="http://mi.eng.cam.ac.uk/~cz277/doc/Slides-PAC.pdf"><title>Slides-PAC.pdf</title><description></description><link>http://mi.eng.cam.ac.uk/~cz277/doc/Slides-PAC.pdf</link><dc:creator>kirk86</dc:creator><dc:date>2019-06-13T14:31:23+02:00</dc:date><dc:subject>foundations learning theory </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2019-06-13T14:31:23+02:00&#034; href=&#034;http://mi.eng.cam.ac.uk/~cz277/doc/Slides-PAC.pdf&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://mi.eng.cam.ac.uk/~cz277/doc/Slides-PAC.pdf&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/foundations"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.mit.edu/~9.520/fall18/#psets"><title>9.520/6.860, Fall 2018</title><description></description><link>http://www.mit.edu/~9.520/fall18/#psets</link><dc:creator>kirk86</dc:creator><dc:date>2019-05-24T11:13:04+02:00</dc:date><dc:subject>bounds complexity compression course generalization learning sampling stats theory </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2019-05-24T11:13:04+02:00&#034; href=&#034;http://www.mit.edu/~9.520/fall18/#psets&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.mit.edu/~9.520/fall18/#psets&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/bounds"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/compression"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/generalization"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/sampling"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/stats"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="https://cs.nyu.edu/~mohri/mlbook/"><title>Mehryar Mohri -- Foundations of Machine Learning - Book</title><description></description><link>https://cs.nyu.edu/~mohri/mlbook/</link><dc:creator>kirk86</dc:creator><dc:date>2019-05-20T02:12:28+02:00</dc:date><dc:subject>book bounds foundations generalization learning probability stats theory </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2019-05-20T02:12:28+02:00&#034; href=&#034;https://cs.nyu.edu/~mohri/mlbook/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://cs.nyu.edu/~mohri/mlbook/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/book"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/bounds"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/foundations"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/generalization"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/probability"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/stats"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="https://people.eecs.berkeley.edu/~wainwrig/stat241b/"><title>EECS 281B / STAT 241B Home Page</title><description></description><link>https://people.eecs.berkeley.edu/~wainwrig/stat241b/</link><dc:creator>kirk86</dc:creator><dc:date>2019-04-29T05:37:38+02:00</dc:date><dc:subject>course learning stats theory </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2019-04-29T05:37:38+02:00&#034; href=&#034;https://people.eecs.berkeley.edu/~wainwrig/stat241b/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://people.eecs.berkeley.edu/~wainwrig/stat241b/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/stats"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://stat.wharton.upenn.edu/~skakade/courses/stat928/"><title>Stat 928: Statistical Learning Theory, Spring 2011</title><description>Statistical Learning Theory Sham Kakade</description><link>http://stat.wharton.upenn.edu/~skakade/courses/stat928/</link><dc:creator>kirk86</dc:creator><dc:date>2019-04-29T05:36:43+02:00</dc:date><dc:subject>course learning stats theory </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Statistical Learning Theory Sham Kakade&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/stats"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.stat.berkeley.edu/~bartlett/courses/2014spring-cs281bstat241b/"><title>CS 281B / Stat 241B Spring 2014</title><description></description><link>https://www.stat.berkeley.edu/~bartlett/courses/2014spring-cs281bstat241b/</link><dc:creator>kirk86</dc:creator><dc:date>2019-04-29T05:36:03+02:00</dc:date><dc:subject>course learning stats theory </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2019-04-29T05:36:03+02:00&#034; href=&#034;https://www.stat.berkeley.edu/~bartlett/courses/2014spring-cs281bstat241b/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://www.stat.berkeley.edu/~bartlett/courses/2014spring-cs281bstat241b/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/stats"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="https://web.stanford.edu/class/cs229t/"><title>https://web.stanford.edu/class/cs229t/</title><description>Statistical Learning Theory Course from Tengyu Ma</description><link>https://web.stanford.edu/class/cs229t/</link><dc:creator>kirk86</dc:creator><dc:date>2019-04-29T05:35:32+02:00</dc:date><dc:subject>course learning stats theory </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Statistical Learning Theory Course from Tengyu Ma&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/stats"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://videolectures.net/mlss03_bousquet_slt/"><title>Statistical Learning Theory - VideoLectures.NET</title><description>This course will give a detailed introduction to learning theory with a focus on the classification problem. It will be shown how to obtain (pobabilistic) bounds on the generalization error for certain types of algorithms. The main themes will be: * probabilistic inequalities and concentration inequalities * union bounds, chaining * measuring the size of a function class, Vapnik Chervonenkis dimension, shattering dimension and Rademacher averages * classification with real-valued functions  Some knowledge of probability theory would be helpful but not required since the main tools will be introduced.</description><link>http://videolectures.net/mlss03_bousquet_slt/</link><dc:creator>kirk86</dc:creator><dc:date>2019-04-26T13:50:17+02:00</dc:date><dc:subject>bounds generalization learning mathematics probability stats theory </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;This course will give a detailed introduction to learning theory with a focus on the classification problem. It will be shown how to obtain (pobabilistic) bounds on the generalization error for certain types of algorithms. The main themes will be: * probabilistic inequalities and concentration inequalities * union bounds, chaining * measuring the size of a function class, Vapnik Chervonenkis dimension, shattering dimension and Rademacher averages * classification with real-valued functions  Some knowledge of probability theory would be helpful but not required since the main tools will be introduced.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/bounds"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/generalization"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/mathematics"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/probability"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/stats"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="https://howsheilaseesit.blog/2017/03/13/time-for-analytics-of-the-oppressed-my-starter-for-10-for-digifest-debate/"><title>Time for Analytics of the Oppressed? – my starter for 10 for #digifest debate – howsheilaseesIT</title><description></description><link>https://howsheilaseesit.blog/2017/03/13/time-for-analytics-of-the-oppressed-my-starter-for-10-for-digifest-debate/</link><dc:creator>georgeroberts</dc:creator><dc:date>2017-08-02T10:39:57+02:00</dc:date><dc:subject>analytics education higher learning social theory </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2017-08-02T10:39:57+02:00&#034; href=&#034;https://howsheilaseesit.blog/2017/03/13/time-for-analytics-of-the-oppressed-my-starter-for-10-for-digifest-debate/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://howsheilaseesit.blog/2017/03/13/time-for-analytics-of-the-oppressed-my-starter-for-10-for-digifest-debate/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/analytics"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/education"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/higher"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/social"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="https://journal.thriveglobal.com/how-technology-hijacks-peoples-minds-from-a-magician-and-google-s-design-ethicist-56d62ef5edf3"><title>How Technology is Hijacking Your Mind — from a Former Insider</title><description></description><link>https://journal.thriveglobal.com/how-technology-hijacks-peoples-minds-from-a-magician-and-google-s-design-ethicist-56d62ef5edf3</link><dc:creator>georgeroberts</dc:creator><dc:date>2017-05-10T07:42:32+02:00</dc:date><dc:subject>culture design education higher learning marketing philosophy theory </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2017-05-10T07:42:32+02:00&#034; href=&#034;https://journal.thriveglobal.com/how-technology-hijacks-peoples-minds-from-a-magician-and-google-s-design-ethicist-56d62ef5edf3&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://journal.thriveglobal.com/how-technology-hijacks-peoples-minds-from-a-magician-and-google-s-design-ethicist-56d62ef5edf3&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/culture"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/design"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/education"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/higher"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/marketing"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/philosophy"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.businessballs.com/generations-nicknames-theories.htm"><title>Generational nicknames and theories: Baby Boomers, Generation X, Generation Y, etc, from 1800 to 2000s - social, political, technological effects on the personality of human generations</title><description></description><link>http://www.businessballs.com/generations-nicknames-theories.htm</link><dc:creator>georgeroberts</dc:creator><dc:date>2017-03-17T08:12:22+01:00</dc:date><dc:subject>learning theory </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2017-03-17T08:12:22+01:00&#034; href=&#034;http://www.businessballs.com/generations-nicknames-theories.htm&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.businessballs.com/generations-nicknames-theories.htm&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.hdc.ed.ac.uk/"><title>History of Distributed Cognition</title><description></description><link>http://www.hdc.ed.ac.uk/</link><dc:creator>georgeroberts</dc:creator><dc:date>2017-03-17T08:11:52+01:00</dc:date><dc:subject>education higher learning theory </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2017-03-17T08:11:52+01:00&#034; href=&#034;http://www.hdc.ed.ac.uk/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.hdc.ed.ac.uk/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/education"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/higher"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.theguardian.com/education/2017/mar/12/no-evidence-to-back-idea-of-learning-styles"><title>No evidence to back idea of learning styles | Letter | Education | The Guardian</title><description></description><link>https://www.theguardian.com/education/2017/mar/12/no-evidence-to-back-idea-of-learning-styles</link><dc:creator>georgeroberts</dc:creator><dc:date>2017-03-17T08:11:02+01:00</dc:date><dc:subject>learning styles theory </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2017-03-17T08:11:02+01:00&#034; href=&#034;https://www.theguardian.com/education/2017/mar/12/no-evidence-to-back-idea-of-learning-styles&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://www.theguardian.com/education/2017/mar/12/no-evidence-to-back-idea-of-learning-styles&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/styles"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item></rdf:RDF>